Maximal set - PDFSEARCH.IO - Document Search Engine

Maximal set
Results: 92

#	Item
11	Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a mess Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-10-28 15:42:58 Graph theory NP-complete problems Graph coloring Independent set Maximal independent set
12	Computing minimal mappings between Lightweight Ontologies Add to Reading List Source URL: livingknowledge.europarchive.org Language: English - Date: 2012-01-24 05:13:29 Semantic Web Ontology Information science Computing World Wide Web Consortium Minimal mappings Lightweight ontology Web Ontology Language B-tree Partially ordered set Maximal element Semantic matching
13	Ultra-Fast Rumor Spreading in Social Networks Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2012-04-03 10:06:29 Mathematics Graph theory Discrete mathematics Second moment method Graph Maximal independent set Draft:Sub-linear time algorithm
14	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
15	A method for finding the maximal set in excess demand Add to Reading List Source URL: erlanson.weebly.com Language: English - Date: 2016-05-25 09:51:01 Auction theory Competition Competitive equilibrium Market Game theory Mathematics NP-complete problems
16	Geometric Ad-Hoc Routing: Of Theory and Practice Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:48 Graph theory Mathematics Graph coloring Maximal independent set
17	CS364B: Exercise Set #5 Optional (no due date) Lecture 9 Exercises Exercise 28 (Optional – Do Not Hand In) Let x be a maximal-in-distributional-range (MIDR) allocation rule. Recall that coupling x with the payment Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-06 14:03:54 Mechanism design Mathematics Algebraic geometry Field theory Valuation Constructible universe Game theory Auction theory
18	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
19	i i “imvol3” — — 15:41 — page 445 — #1 i Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2008-03-31 06:45:00 Graph theory Random walk PageRank Matrix Maximal independent set Trapezoid graph
20	Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:03 Graph theory NP-complete problems Combinatorial optimization Planar graphs Dominating set Matching Graph coloring Maximal independent set